Parallel Deterministic Transport Sweeps of Structured and Unstructured Meshes with Overloaded Mesh Decompositions

An Algorithm for Parallel Sn Sweeps on Unstructured Meshes

We develop a new algorithm for performing parallel Sn sweeps on unstructured meshes. The algorithm uses a low-complexity list ordering heuristic to determine a sweep ordering on any partitioned mesh. For typical problems and with \normal" mesh partitionings we have observed nearly linear speedups on up to 126 processors. This is an important and desirable result, since although analyses of stru...

Robust Parallel Adaptive Mesh Refinement Software Library for Unstructured Meshes

Parallel Partitioning of Unstructured Meshes

A method is outlined for optimising graph partitions which arise in mapping unstructured mesh calculations to parallel computers. The method employs a combination of iterative techniques to both evenly balance theworkload andminimise the number and volume of interprocessor communications. They are designed to work efficiently in parallel as well as sequentially and when combined with a fast dir...

Parallel Refinement of Unstructured Meshes

In this paper we describe a parallel h-refinement algorithm for unstructured finite element meshes based on the longest-edge bisection of triangles and tetrahedrons. This algorithm is implemented in PARED, a system that supports the parallel adaptive solution of PDEs. We discuss the design of such an algorithm for distributed memory machines including the problem of propagating refinement acros...

Parallel Unstructured Mesh Partitioning